Matching "versus" mechanism design

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanism Design without Money via Stable Matching

Mechanism design without money has a rich history in social choice literature. Due to thestrong impossibility theorem by Gibbard and Satterthwaite, exploring domains in which thereexist dominant strategy mechanisms is one of the central questions in the field. We propose ageneral framework, called the generalized packing problem (gpp), to study the mechanism designquestions with...

متن کامل

Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design

We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same time maximize a given valuation function. This framework captures the budgeted version of several well known optimization problems, and when the resources are o...

متن کامل

Repeated Matching Mechanism Design with Moral Hazard and Adverse Selection

In crowdsourcing systems, the mechanism designer aims to repeatedly match a set of tasks of varying qualities (high quality tasks generate high revenue), which are known to the designer, to a set of agents of varying qualities (high quality agents generate high revenue), which are unknown to the designer and to the agents themselves, such that the overall system performance (e.g. total revenue)...

متن کامل

Transversals, systems of distinct representatives, mechanism design, and matching

A transversal generated by a system of distinct representatives (SDR) for a collection of sets consists of an element from each set (its representative) such that the representative uniquely identifies the set it belongs to. Theorem 1 gives a necessary and sufficient condition that an arbitrary collection, finite or infinite, of sets, finite or infinite, have an SDR. The proof is direct, short....

متن کامل

Ordinal versus cardinal voting rules: A mechanism design approach

We consider the performance and incentive compatibility of voting rules in a Bayesian environment with independent private values and at least three alternatives. It is shown that every (ex-ante) Pareto efficient ordinal rule among neutral rules is incentive compatible under a symmetry assumption on alternatives. Furthermore, we prove that there exists an incentive compatible cardinal rule whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGecom Exchanges

سال: 2012

ISSN: 1551-9031

DOI: 10.1145/2509002.2509005